Communicating X-Machines: From Theory to Practice
نویسندگان
چکیده
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes a methodology of building communicating Xmachines from existing stand-alone X-machine models and presents the theory that drives this methodology. A X-machine is a formal method that resembles a finite state machine but can model non-trivial data structures. This is accomplished by incorporating a typed memory tuple into the model as well as transitions labeled with functions that operate on inputs and memory values. A set of X-machines can exchange messages with each other, thus building a communicating system model. However, existing communicating X-machines theories imply that the components of a communicating system should be built from scratch. We suggest that modeling of complex systems can be split into two separate and distinct activities: (a) the modeling of stand-alone X-machine components and (b) the description of the communication between these components. This approach is based on a different view of the theory of communicating X-machines and it leads towards disciplined, practical, and modular development. The proposed methodology is accompanied by an example, which demonstrates the use of communicating X-machines towards the modeling of large-scale systems.
منابع مشابه
Automatic Generation of Java Code From Communicating X-machine specifications
The state transition diagrams of the queue and button X-machines The state transition diagram of the lift X-machine v Declaration All sentences or passages quoted in this dissertation from other people's work have been specifically acknowledged by clear cross-referencing to author, work and page(s). Any illustrations which are not the work of the author of this dissertation have been used with ...
متن کاملCommunicating Stream X-Machines Systems are no more than X-Machines
A version of the communicating stream X-machine model is proposed, which gives a precise representation of the operation of transferring data from one X-machine to another. For this model it is shown that systems of communicating Xmachines have the same computational power as single stream X-machines. This enable existing methods for deriving test strategies for stream X-machines to be extended...
متن کاملSimulation and Verification of P Systems through Communicating X-machines P.Kefalas1, G.Eleftherakis1, M.Holcombe2 and M.Gheorghe2
The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating...
متن کاملA New Approach to Communicating X-Machines Systems
This paper presents a new model for the speci cation of communicating X-machine systems (CXMS). In previous papers, systems of X-machines have been implemented in two ways: using an unique X-machine which simulates the concurrent behaviour of several processes [1], or using several X-machines which communicate through asynchronous channels [2]. This article introduces an X-machine system for wh...
متن کاملSimulation and verification of P systems through communicating X-machines.
The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001